Writing Larch interface language specifications
نویسندگان
چکیده
منابع مشابه
Debugging Larch Shared Language Specifications
The Larch family of specification languages supports a two-tiered definitional approach to specification. Each specification has components written in two languages: one designed for a specific programming language and another independent of any programming language. The former are called Larch interface languages, and the latter the Larch Shared Language (LSL). The Larch style of specification...
متن کاملSpill - A Logic Language for Writing Testable Requirements Specifications
A requirements speciication is the rst formal description of a program. Formal methods of program construction can be practically useful only when the requirements speciication can be shown to be adequate. This must be done by informal means: inspection and testing. Current speciication languages do not easily support both inspection and testing. We propose a speciication language, Spill, which...
متن کاملOn the Language Design and Semantic Foundation of LCL a Larch C Interface Speci cation Language
On the Language Design and Semantic Foundation of LCL a Larch C Interface Speci cation Language The specialization of a speci cation language to a particular programming lan guage is an important characteristic of module interface speci cation languages MISL s The only well developed MISL s are the Larch interface languages and among these LCL a Larch C interface speci cation language would see...
متن کاملThe Larch / Smalltalk Interface Speci cation
Object-oriented programming languages, such as Smalltalk, help one to build reusable program modules. The reuse of program modules requires adequate documentation | formal or informal. Larch/Smalltalk is a formal speciication language for specifying such reusable Smalltalk modules. Larch/Smalltalk rmly separates speciication from implementation. In Larch/Smalltalk the unit of speciication is an...
متن کاملWriting Declarative Specifications for Clauses
Modern satisfiability (SAT) solvers provide an efficient implementation of classical propositional logic. Their input language, however, is based on the conjunctive normal form (CNF) of propositional formulas. To use SAT solver technology in practice, a user must create the input clauses in one way or another. A typical approach is to write a procedural program that generates formulas on the ba...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Programming Languages and Systems
سال: 1987
ISSN: 0164-0925,1558-4593
DOI: 10.1145/9758.10500